Timing Analysis of Parallel Software Using Abstract Execution
نویسندگان
چکیده
Execution Originally a program flow analysis for sequential programs [Gustafsson et al, 2006] Finds constraints on program flow through a kind of symbolic execution – “abstract execution” (AE) AE executes the program with abstract states, representing sets of real (“concrete”) states Can be seen as a a kind of value analysis (abstract interpretation) We have extended it with time [Gustafsson et al, 2011], and to handle thread-parallel programs EACO Workshop 2014 10
منابع مشابه
Toward Static Timing Analysis of Parallel Software
The current trend within computer, and even real-time, systems is to incorporate parallel hardware, e.g., multicore processors, and parallel software. Thus, the ability to safely analyse such parallel systems, e.g., regarding the timing behaviour, becomes necessary. Static timing analysis is an approach to mathematically derive safe bounds on the execution time of a program, when executed on a ...
متن کاملStatic Timing Analysis of Parallel Systems Using Abstract Execution
The Power Wall has stopped the past trend of increasing processor throughput by increasing the clock frequency and the instruction level parallelism. Therefore, the current trend in computer hardware design is to expose explicit parallelism to the software level. This is most often done using multiple processing cores situated on a single processor chip. The cores usually share some resources o...
متن کاملNon-preemptive Scheduling of Real-Time Software Transactional Memory
Recent embedded processor architectures containing multiple heterogeneous cores and non-coherent caches, bring renewed attention to the use of Software Transactional Memory (STM) as a building block for developing parallel applications. STM promises to ease concurrent and parallel software development, but relies on the possibility of abort conflicting transactions to maintain data consistency,...
متن کاملOn Static Timing Analysis of GPU Kernels
We study static timing analysis of programs running on GPU accelerators. Such programs follow a data parallel programming model that allows massive parallelism on manycore processors. Data parallel programming and GPUs as accelerators have received wide use during the recent years. The timing analysis of programs running on single core machines is well known and applied also in practice. Howeve...
متن کاملINFER: Interactive Timing Profiles based on Bayesian Networks
We propose an approach for timing analysis of software-based embedded computer systems that builds on the established probabilistic framework of Bayesian networks. We envision an approach where we take (1) an abstract description of the control flow within a piece of software, and (2) a set of run-time traces, which are combined into a Bayesian network that can be seen as an interactive timing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014